Learning Rules from Very Large Databases: A Rough Multiset Approach

نویسنده

  • Chien-Chung Chan
چکیده

This paper presents a mechanism LERS-M for learning production rules from very large databases. The task of learning is formulated by the concept of multiset decision tables based on rough multisets and information multisystems. LERS-M is tightly coupled with object-relational database systems, and it can also work on distributed database systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Incremental Data Mining from Very Large Databases: A Rough Multiset Approach

This paper presents a mechanism for developing distributed learners for learning production rules from massive, dynamic, and distributed databases. The task of distributed learning is formulated by the concept of multiset decision tables that is based on rough multisets and information multisystems, which are derived from the theory of rough sets. We use the concept of partition of boundary set...

متن کامل

Learning Rules from Very Large Databases Using Rough Multisets

This paper presents a mechanism called LERS-M for learning production rules from very large databases. It can be implemented using objectrelational database systems, it can be used for distributed data mining, and it has a structure that matches well with parallel processing. LERS-M is based on rough multisets and it is formulated using relational operations with the objective to be tightly cou...

متن کامل

A New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)

Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...

متن کامل

A Rough Set Approach to Compute All MaximalGeneralized Rules in Relational Databases

Database stores a huge amount of information in a structured and organized manner and provides many features for machine learning. There are a lot of algorithms to discover diierent kinds of rules from databases. In this paper, we propose a new method which can compute all maximal generalized rules in relational databases. The method integrates the machine learning paradigm, especially learning...

متن کامل

Learning in Relational Databases: A Rough Set Approach

Knowledge discovery in databases, or data mining, is an important direction in the development of data and knowledge-based systems. Because of the huge amount of data stored in large numbers of existing databases, and because the amount of data generated in electronic forms is growing rapidly, it is necessary to develop efficient methods to extract knowledge from databases. An attribute-oriente...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002